Generalized simulated annealing algorithms using Tsallis statistics: Application to conformational optimization of a tetrapeptide.
نویسندگان
چکیده
A Monte Carlo simulated annealing algorithm based on the generalized entropy of Tsallis is presented. The algorithm obeys detailed balance and reduces to a steepest descent algorithm at low temperatures. Application to the conformational optimization of a tetrapeptide demonstrates that the algorithm is more effective in locating low energy minima than standard simulated annealing based on molecular dynamics or Monte Carlo methods.
منابع مشابه
Generalized Simulated Annealing for Global Optimization: The GenSA Package
Many problems in statistics, finance, biology, pharmacology, physics, mathematics, economics, and chemistry involve determination of the global minimum of multidimensional functions. R packages for different stochastic methods such as genetic algorithms and differential evolution have been developed and successfully used in the R community. Based on Tsallis statistics, the R package GenSA was d...
متن کاملTackling the Protein Folding Problem by a Generalized-Ensemble Approach with Tsallis Statistics
We review uses of Tsallis statistical mechanics in the protein folding problem. Monte Carlo simulated annealing algorithm and generalized-ensemble algorithm with both Monte Carlo and stochastic dynamics algorithms are discussed. Simulations by these algorithms are performed for a penta peptide, Met-enkephalin. In particular, for generalized-ensemble algorithms, it is shown that from only one si...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملAn Exact Random Number Generator for Visiting Distribution in Gsa
Global optimization is widely used in various aspects both in industry and academia. Although different methods in operations research have been proposed to solve the global optimization, simulated annealing and its variations have been favored for their simplicity in the implementation. In order to reach the global optimum from the current solution, a walking mechanism must be planned so that ...
متن کاملGenetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy
This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
دوره 53 4 شماره
صفحات -
تاریخ انتشار 1996